Balancing expressiveness in formal approaches to concurrency

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstraction as a Unifying Link for Formal Approaches to Concurrency

ion as a unifying link for formal approaches to concurrency

متن کامل

Dagstuhl Seminar Expressiveness in Concurrency

Contents iii 1 Preface One of the main research objectives of computer science is the development of formal methods for the design and implementation of programming languages. This research area has witnessed a proliferation of concepts, models and methods. However, the problem of the relative expressive power of the various programming concepts has rarely been addressed systematically. A syste...

متن کامل

Expressiveness via Intensionality and Concurrency

Computation can be considered by taking into account two dimensions: extensional versus intensional, and sequential versus concurrent. Traditionally sequential extensional computation can be captured by the λ-calculus. However, recent work shows that there are more expressive intensional calculi such as S F-calculus. Traditionally process calculi capture computation by encoding the λ-calculus, ...

متن کامل

Higher-Order Concurrency: Expressiveness and Decidability Results

ion is an expression of the form (x)Pit is a parameterized process. An abstraction has a functional type. Applying an abstraction (x)P of type T → ♦ (where ♦ is the type of all processes) to an argument W of type T yields the process P{W/x}. The argument W can itself be an abstraction; therefore the order of an abstraction, that is, the level of arrow nesting in its type, can be arbitrarily hi...

متن کامل

Higher-Order Concurrency: Expressiveness and Decidability Results

ion is an expression of the form (x)Pit is a parameterized process. An abstraction has a functional type. Applying an abstraction (x)P of type T → ♦ (where ♦ is the type of all processes) to an argument W of type T yields the process P{W/x}. The argument W can itself be an abstraction; therefore the order of an abstraction, that is, the level of arrow nesting in its type, can be arbitrarily hi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Formal Aspects of Computing

سال: 2014

ISSN: 0934-5043,1433-299X

DOI: 10.1007/s00165-014-0310-2